图C4n＋2×P4k＋3的优美性

It is shown that the product graph C_4n＋2×P_4k＋3 is graceful.     

Variable neighborhood search for extremal graphs. 21. Conjectures and results about the independence number

A set of vertices S in a graph G is independent if no neighbor of a vertex of S belongs to S. The independence number α is the maximum cardinality of an independent set of G. A series of best possible lower and upper bounds on α and some other common invariants of G are obtained by the system AGX 2, and proved either automatically or by hand. In the present paper, we report on such lower and upper bounds considering, as second invariant, minimum, average and maximum degree, diameter, radius, average distance, spread of eccentricities, chromatic number and matching number.     

Regularity of Weak Solutions and Their Attractors for a Parabolic Feedback Control Problem

We investigate additional regularity properties of all globally defined weak solutions, their global and trajectory attractors for a class of autonomous differential inclusion with upper semi-continuous interaction function, when initial data $u_{\tau}\in L^2(\Omega)$ . The main contributions of this paper are: (i) additional regularity and new topological properties of all weak solutions of parabolic feedback control problem with upper semi-continuous interaction function, (ii) a sufficient condition for regularity of global and trajectory attractors, and (iii) new a priory estimates for all weak solutions.